Obtaining unique oligos from an EST database is a problem of great importance in bioinformatics, particularly in the discovery of\r\nnew genes and the mapping of the human genome.Many algorithms have been developed to find unique oligos, many of which are\r\nmuch less time consuming than the traditional brute force approach. An algorithm was presented by Zheng et al. (2004) which finds\r\nthe solution of the unique oligos search problem efficiently.We implement this algorithm as well as several new algorithms based\r\non some theorems included in this paper.We demonstrate how, with these new algorithms, we can obtain unique oligosmuch faster\r\nthan with previous ones.We parallelize these new algorithms to further improve the time of finding unique oligos. All algorithms\r\nare run on ESTs obtained from a Barley EST database.
Loading....